The Strong Domination Alteration Sets in Fuzzy Graphs
نویسندگان
چکیده
In this paper, the effect of the removal of a node or an arc of a fuzzy graph on the minimum strong dominating set of the fuzzy graph is studied. The motivation behind this study is the identification of fault tolerance in the topological design of a network. That is, the ability of the network to provide service even when it contains a faulty component or components. MSC: 05C69.
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملConnected domination in fuzzy graphs using strong arcs
Abstract. In this paper, connected domination in fuzzy graphs using strong arcs is introduced. The strong connected domination number of different classes of fuzzy graphs is obtained. An upper bound for the strong connected domination number of fuzzy graphs is obtained. Strong connected domination in fuzzy trees is studied. It is established that the set of fuzzy cut nodes of a fuzzy tree is a ...
متن کاملTotal Domination in Fuzzy Graphs Using Strong Arcs
In this paper we introduce the concept of strong total domination in fuzzy graphs. We determine the strong total domination number for several classes of fuzzy graphs. A lower bound and an upper bound for the strong total domination number in terms of strong domination number is obtained. Strong total domination in fuzzy trees is studied. A necessary and sufficient condition for the set of fuzz...
متن کاملNon Split Domination on Intuitionistic Fuzzy Graphs
A dominating set D of an IFG G = (V, E) is a non-split dominating set, if the induced intuitionistic fuzzy subgraph 〈ܸ − 〉ܦ is connected. The Non-split domination number ߛ ௦ ሺܩሻ of IFG G is the minimum cardinality of all Non-split dominating set. In this paper we study some theorems in Non-split dominating sets of IFG and some results of ߛ ௦ ሺܩሻwith other known parameters of IFG G. 1. In...
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کامل